Hybrid Tractable Classes of Constraint Problems
نویسندگان
چکیده
We present a survey of complexity results for hybrid constraint satisfaction problems (CSPs) and valued constraint satisfaction problems (VCSPs). These are classes of (V)CSPs defined by restrictions that are not exclusively language-based or structure-based. 1998 ACM Subject Classification F.4.1 Mathematical Logic, G.2.1 Combinatorics, G.2.2 Graph Theory, F.1.3 Complexity Measures and Classes, G.1.6 Optimization
منابع مشابه
Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems
As a central problem in AI, the Constraint Satisfaction Problem (CSP), has been a popular paradigm to cope with complex combinational problems. A CSP consists of a set of variables and a set of constraints restricting the combinations of values taken by variables. The Quantified Constraint Satisfaction Problem (QCSP) is a generalization of the CSP, where variables are existentially or universal...
متن کاملThe tractability of CSP classes defined by forbidden patterns
The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent on identifying tractable subclasses. The main two approaches consider structural properties (restrictions on the hypergraph of constraint scopes) and relational properties (restrictions on the language ...
متن کاملA New Hybrid Tractable Class of Soft Constraint Problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractability in such problems. In this paper we study hybrid tractability of soft constraint problems; that is, properties which guarantee tractability of the given soft constraint problem, but properties which do not depend ...
متن کاملHybrid tractability of constraint satisfaction problems with global constraints
A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed combinations of values, or intensionally, whether by an equation, propositional logic formula, or other means. Intensionally represented constraints, known as g...
متن کاملTractable Triangles and Cross-Free Convexity in Discrete Optimisation
The minimisation problem of a sum of unary and pairwise functions of discrete variables is a general NP-hard problem with wide applications such as computing MAP configurations in Markov Random Fields (MRF), minimising Gibbs energy, or solving binary Valued Constraint Satisfaction Problems (VCSPs). We study the computational complexity of classes of discrete optimisation problems given by allow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017